COMPUTING SIGNED PERMUTATIONS OF POLYGONS
نویسندگان
چکیده
منابع مشابه
Computing signed permutations of polygons
Given a planar polygon (or chain) with a list of edges {e1, e2, e3, . . . , en−1, en}, we examine the effect of several operations that permute this edge list, resulting in the formation of a new polygon. The main operations that we consider are: reversals which involve inverting the order of a sublist, transpositions which involve interchanging subchains (sublists), and edge-swaps which are a ...
متن کاملPairings and Signed Permutations
Identity (1) is easy to prove: note that the left side is a convolution, so multiply it by xn , sum, and recognize the square of a binomial series. But a combinatorial interpretation of the same identity is not so easy to find. In [3], M. Sved recounts the story of the identity and its combinatorial proofs. She relates how, after she challenged her readers (in a previous article) to find a comb...
متن کاملRestricted Permutations and Polygons
Several authors have examined connections among restricted permutations and different combinatorial structures. In this paper we establish a bijection between the set of permutations π which avoid 1322 and the set of odd-dissection convex polygons, where a permutation avoids ab2c if there are no i < j < k − 1 such that πiπjπk is order-isomorphic to abc. We also exhibit bijections between the se...
متن کاملConsensus Ranking with Signed Permutations
Signed permutations (also known as the hyperoctahedral group) are used in modeling genome rearrangements. The algorithmic problems they raise are computationally demanding when not NP-hard. This paper presents a tractable algorithm for learning consensus ranking between signed permutations under the inversion distance. This can be extended to estimate a natural class of exponential models over ...
متن کاملUse of Signed Permutations in Cryptography
In this paper we consider cryptographic applications of the arithmetic on the hyperoctahedral group. On an appropriate subgroup of the latter, we particularly propose to construct public key cryptosystems based on the discrete logarithm. The fact that the group of signed permutations has rich properties provides fast and easy implementation and makes these systems resistant to attacks like the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Geometry & Applications
سال: 2011
ISSN: 0218-1959,1793-6357
DOI: 10.1142/s0218195911003561